Note on partitions into polynomials with number of parts in an arithmetic progression
نویسندگان
چکیده
Let [Formula: see text] be a polynomial with the property that corresponding to every prime there exists an integer such text]. In this paper, we establish some equidistributed results between number of partitions whose parts are taken from sequence and those which in certain arithmetic progression.
منابع مشابه
The Arithmetic of Partitions into Distinct Parts
so that Q(n) is odd if and only if n is a pentagonal number. This fact was generalized by Gordon and Ono [4], who demonstrated that for any positive integer k almost all values of Q(n) are divisible by 2k, and by Ono and Penniston [7], who found an exact formula for Q(n) modulo 8. Their techniques do not apply to odd primes, however, and for these primes the situation seems to be more difficult...
متن کاملA note on partitions into distinct parts and odd parts
Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...
متن کاملOn the Partitions of a Number into Arithmetic Progressions
The paper investigates the enumeration of the set AP(n) of partitions of a positive integer n in which the nondecreasing sequence of parts form an arithmetic progression. We establish formulas for such partitions, and characterize a class of integers n with the property that the length of every member of AP(n) divides n. We prove that the number of such integers is small.
متن کاملOn the enumeration of partitions with summands in arithmetic progression
Enumerating formulae are constructed which count the number of partitions of a positive integer into positive summands in arithmetic progression with common difference D. These enumerating formulae (denoted pD(n)) which are given in terms of elementary divisor functions together with auxiliary arithmetic functions (to be defined) are then used to establish a known characterisation for an intege...
متن کاملIdentities Relating the Number of Partitions into an Even and Odd Number of Parts
If / > 0 and n > 1, let qf (n) denote the number of partitions of/? into an even number of parts, where each part occurs at most / times and Set qf(n) denote the number of partitions of n into an odd number of parts, where each part occurs at most/times. \ii>0, \etqf(0)= 1 andqf(0) = 0. For/ >Oandn > 0, \v\Aj(n) = qJ(n)-q°(n). For/= 1, it is well known [1] that , A (n) = I ~ i f n = f ^ orsome ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2021
ISSN: ['1793-7310', '1793-0421']
DOI: https://doi.org/10.1142/s1793042121500718